Logic Column 16: Higher-Order Abstract Syntax: Setting the Record Straight
نویسندگان
چکیده
In this issue, Karl Crary and Robert Harper respond to the critique of higher-order abstract syntax appearing in Logic Column 14, “Nominal Logic and Abstract Syntax” (SIGACT News 36(4), December 2005). I am always looking for contributions. If you have any suggestion concerning the content of the Logic Column, or if you would like to contribute by writing a column yourself, feel free to get in touch with me.
منابع مشابه
[hal-00772522, v1] Relating nominal and higher-order abstract syntax specifications
Nominal abstract syntax and higher-order abstract syntax provide a means for describing binding structure which is higher-level than traditional techniques. These approaches have spawned two different communities which have developed along similar lines but with subtle differences that make them difficult to relate. The nominal abstract syntax community has devices like names, freshness, name-a...
متن کاملFree Variables and Subexpressions in Higher-Order Meta Logic
This paper addresses the problem of how to represent free variables and subexpressions involving-bindings. The aim is to apply what is known as higher-order abstract syntax to higher-order term rewriting systems. Directly applying-reduction for the purpose of subterm-replacement is incompatible with the requirements of term-rewriting. A new meta-level representation of subterms is developed tha...
متن کاملImplementing a Program Logic of Objects in a Higher-Order Logic Theorem Prover
We present an implementation of a program logic of objects, extending that (AL) of Abadi and Leino. In particular, the implementation uses higher-order abstract syntax (HOAS) and—unlike previous approaches using HOAS—at the same time uses the built-in higher-order logic of the theorem prover to formulate specifications. We give examples of verifications, extending those given in [1], that have ...
متن کاملHybridLF : a system for reasoning in higher-order abstract syntax
In this thesis we describe two new systems for reasoning about deductive systems: HybridLF and Canonical HybridLF. HybridLF brings together the Hybrid approach (due to Ambler, Crole and Momigliano [15]) to higher-order abstract syntax (HOAS) in Isabelle/HOL with the logical framework LF, a dependently-typed system for proving theorems about logical systems. Hybrid provides a version of HOAS in ...
متن کاملFormalising the pi-Calculus Using Nominal Logic
We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to conduct machine checkable proofs, closely following the intuitive arguments found in manual proofs. In this way we have covered many of the standa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0607141 شماره
صفحات -
تاریخ انتشار 2006